Capacity scaling algorithm for scalable M-convex submodular flow problems
نویسندگان
چکیده
An M-convex function is a nonlinear discrete function defined on integer points introduced by Murota in 1996, and the M-convex submodular flow problem is one of the most general frameworks of efficiently solvable combinatorial optimization problems. It includes the minimum cost flow and the submodular flow problems as its special cases. In this paper, we first devise a successive shortest path algorithm for the Mconvex submodular flow problem. We then propose an efficient algorithm based on a capacity scaling framework for the scalable M-convex submodular flow problem. Here an M-convex function f(x) is said to be scalable if f(x) := f(αx) is also M-convex for any positive integer α.
منابع مشابه
A Capacity Scaling Algorithm for M-convex Submodular Flow
This paper presents a faster algorithm for the M-convex submodular flow problem, which is a generalization of the minimum-cost flow problem with an M-convex cost function for the flow-boundary, where an M-convex function is a nonlinear nonseparable discrete convex function on integer points. The algorithm extends the capacity scaling approach for the submodular flow problem by Fleischer, Iwata ...
متن کاملCore Discussion Paper 9947 a Faster Capacity Scaling Algorithm for Minimum Cost Submodular Flow
We describe an O(nh min{log U, n log n}) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the Edmonds–Karp capacity scaling algorithm for minimum cost flow to solve the minimum cost submodular flow problem. The modification entails scaling a relaxation parameter δ. Capacities are relaxed by attaching a complete directed graph with unifo...
متن کاملA dual descent algorithm for node-capacitated multiflow problems and its applications
In this paper, we develop an O((m log k)MSF(n,m, 1))-time algorithm to find a halfintegral node-capacitated multiflow of the maximum total flow-value in a network with n nodes, m edges, and k terminals, where MSF(n′,m′, γ) denotes the time complexity of solving the maximum submodular flow problem in a network with n′ edges, m′ edges, and the complexity γ of computing the exchange capacity of th...
متن کاملA faster capacity scaling algorithm for minimum cost submodular flow
We describe an O(nhmin{logU, n log n}) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the Edmonds–Karp capacity scaling algorithm for minimum cost flow to solve the minimum cost submodular flow problem. The modification entails scaling a relaxation parameter δ. Capacities are relaxed by attaching a complete directed graph with uniform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Optimization Methods and Software
دوره 18 شماره
صفحات -
تاریخ انتشار 2003